Optimal Improvement Ratios of Multi-Secret Sharing Schemes Can Be Achieved
نویسندگان
چکیده
منابع مشابه
Multi-linear Secret-Sharing Schemes
Multi-linear secret-sharing schemes are the most common secret-sharing schemes. In these schemes the secret is composed of some field elements and the sharing is done by applying some fixed linear mapping on the field elements of the secret and some randomly chosen field elements. If the secret contains one field element, then the scheme is called linear. The importance of multi-linear schemes ...
متن کاملOptimal Non-perfect Uniform Secret Sharing Schemes
A secret sharing scheme is non-perfect if some subsets of participants that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum length of the shares and the length of the secret. This work is dedicated to the search of bounds on the information ratio of non-perfect secret sharing schemes. To this en...
متن کاملRandomness in Multi-Secret Sharing Schemes
A multi{secret sharing scheme is a protocol to share a number of (arbitrarily related) secrets among a set of participants in such a way that only quali ed sets of participants can recover the secrets, whereas non-quali ed sets of participants might have partial information about them. In this paper we analyze the amount of randomness needed by multi{secret sharing schemes. Given an m-tuple of ...
متن کاملAnonymous Secret Sharing Schemes
In this paper we study anonymous secret sharing schemes. Informally, in an anonymous secret sharing scheme the secret can be reconstructed without knowledge of which participants hold which shares. In such schemes the computation of the secret can be carried out by giving the shares to a black box that does not know the identities of the participants holding those shares. Phillips and Phillips ...
متن کاملParallel Multi-party Computation from Linear Multi-secret Sharing Schemes
As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against an adversary with multistructures. Precisely, there are m functions f1, ..., fm and m adversary structures A1, ...,Am, where fi is required to be securely computed against an Ai-adversary. We give a general construction to build...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2016
ISSN: 2261-236X
DOI: 10.1051/matecconf/20167101003